Principles of Distributed Test Synthesis based on True-concurrency Models
نویسنده
چکیده
Automatic synthesis of test cases for conformance testing has been principally developed with the objective of generating sequential test cases. In the distributed system context, it is worth extending the synthesis techniques to the generation of multiple testers. We base our work on our experience in using model-checking techniques, as successfully implemented in the TGV tool. Continuing the works of A. Ulrich and H. König, we propose to use a trueconcurrency model based on graph unfolding. The article presents the principles of a complete chain of synthesis, starting from the definition of test purposes and ending with a projection onto a set of testers.
منابع مشابه
Synthesis of distributed testers from true-concurrency models of reactive systems
Automatic synthesis of test cases for conformance testing has been principally developed with the objective of generating sequential test cases. In the distributed system context, it is worth extending the synthesis techniques to the generation of multiple testers. We base our work on our experience in using modelchecking techniques, as successfully implemented in the TGV tool. Continuing the w...
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کاملTesting Several Rival Models Using the Extension of Vuong\'s Test and Quasi Clustering
The two main goals in model selection are firstly introducing an approach to test homogeneity of several rival models and secondly selecting a set of reasonable models or estimating the best rival model to the true one. In this paper we extend Vuong's method for several models to cluster them. Based on the working paper of Katayama $(2008)$, we propose an approach to test whether rival models h...
متن کاملProbabilistic models for true-concurrency: branching cells and distributed probabilities for event structures
This paper is devoted to true-concurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite. Locally finite event structures exhibit “finite confusion”; in particular, under some mild con...
متن کاملProbabilistic True-Concurrency Models Branching Cells and Distributed Probabilities for Event Structures
This paper is devoted to true-concurrency models for probabilistic systems. By this we mean probabilistic models in which Mazurkiewicz traces, not interleavings, are given a probability. Here we address probabilistic event structures. We consider a new class of event structures, called locally finite. Locally finite event structures exhibit “finite confusion”; in particular, under some mild con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002